<!DOCTYPE html>
<html lang="en">

<head>
  <meta charset="UTF-8">
  <meta http-equiv="X-UA-Compatible" content="IE=edge">
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  <title>LeetBook-初级算法-树</title>
</head>

<body>
  <script>
    function TreeNode(val, left, right) {
      this.val = (val === undefined ? 0 : val)
      this.left = (left === undefined ? null : left)
      this.right = (right === undefined ? null : right)
    }
  </script>
  <!-- <script src="./01-二叉树的最大深度.js"></script> -->
  <!-- <script src="./02-验证二叉搜索树.js"></script> -->
  <!-- <script src="./03-对称二叉树.js"></script> -->
  <!-- <script src="./04-二叉树的层序遍历.js"></script> -->
  <script src="./05-将有序数组转换为二叉搜索树.js"></script>
</body>

</html>